#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 1010;
const int inf = 0x3f3f3f3f;

int cnt,h[N],S,T,ans = inf,maxflow,d[N],now[N],n,m,deg[N];

struct edge{int v,w,nxt;}e[N<<3];
void link(int x,int y,int w){e[++cnt] = (edge){y,w,h[x]};h[x] = cnt;e[++cnt] = (edge){x,0,h[y]};h[y] = cnt;}

vector<pii> ed;

bool bfs(){
	memset(d,0,sizeof(d)); now[S] = h[S]; d[S] = 1; queue<int> q; q.push(S);
	while(q.size()){
		int x = q.front(); q.pop();
		for(int i = h[x],y;i;i = e[i].nxt)
			if(!d[y = e[i].v] && e[i].w){
				d[y] = d[x] + 1; now[y] = h[y]; q.push(y); if(y == T) return 1;
			}
	}return 0;
}

int dfs(int x,int flow){
	if(x == T) return flow; int res = flow;
	for(int i = now[x],y;i && res;i = e[i].nxt){
		now[x] = i;
		if(d[y = e[i].v] == d[x] + 1 && e[i].w){
			int k = dfs(y,min(e[i].w,res));
			if(!k) d[y] = 0; res -= k; e[i].w -= k; e[i ^ 1].w += k;
		}
	}return flow - res;
}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in;
	for(int i = 1;i <= m;i++){
		int u = in,v = in; ed.pb(pii(u,v)); deg[u]++; if(u ^ v) deg[v]++; 
	}
	S = 0,T = n * 2 + 1;
	for(int i = 1;i <= n;i++){
		memset(h,0,sizeof(h)); cnt = 1;
		for(pii t : ed){
			if(t.fi == i || t.se == i) continue;
			link(t.fi,t.se + n,1);
		}
		for(int j = 1;j <= n;j++) link(S,j,1),link(j + n,T,1);
		int flow = 0;maxflow = 0; while(bfs()) while(flow = dfs(S,inf)) maxflow += flow;
		ans = min(ans,(n - 1 - maxflow) + m - maxflow + 2 * n - 1 - deg[i] * 2);
	}
	printf("%d\n",ans);
	return 0;
}

